Square-matrix embeddable space-time block codes for complex signal constellations

نویسندگان

  • Olav Tirkkonen
  • Ari Hottinen
چکیده

Space–time block codes for providing transmit diversity in wireless communication systems are considered. Based on the principles of linearity and unitarity, a complete classification of linear codes is given in the case when the symbol constellations are complex, and the code is based on a square matrix or restriction of such by deleting columns (antennas). Maximal rate delay optimal codes are constructed within this category. The maximal rates allowed by linearity and unitarity fall off exponentially with the number of transmit antennas.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Space-Time Block Codes from Complex Orthogonal Designs

Space-time block codes from orthogonal designs recently proposed by Alamouti, and TarokhJafarkhani-Calderbank have attracted considerable attention due to the fast maximum-likelihood (ML) decoding and the full diversity. There are two classes of space-time block codes from orthogonal designs. One class consists of those from real orthogonal designs for real signal constellations which have been...

متن کامل

Ef cient Space-Time Block Codes Designed by a Genetic Algorithm

Space-time block codes with orthogonal structures typically provide full-diversity reception and simple receiver processing. However, full-rate orthogonal codes for complex constellations have not been found for more than two transmit antennas. By using a genetic algorithm, rate1 space-time block codes that accommodate very simple receiver processing at the cost of reduced diversity are designe...

متن کامل

Diagonal algebraic space-time block codes

We construct a new family of linear space-time block codes by the combination of rotated constellations and the Hadamard transform, and we prove them to achieve the full transmit diversity over a quasi-static or fast fading channels. The proposed codes transmit at a normalized rate of 1 symbol/sec. When the number of transmit antennae n = 1, 2 or n is a multiple of 4 we spread a rotated version...

متن کامل

Space-Time block codes from orthogonal designs

We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbe...

متن کامل

A Novel Maximum Likelihood Detection Algorithm for Orthogonal Space-Time Block Codes

In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal space-time block codes (OSTBCs) based on the real-valued lattice representation and QR decomposition. We show that for a system with rate r = K/T , where K is the number of transmitted symbols per T time slots, the proposed algorithm decomposes the original complex-valued system into a parallel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002